On the Spread-Out Limit for Bond and Continuum Percolation
نویسندگان
چکیده
منابع مشابه
Continuum Percolation with Unreliable and Spread-Out Connections
We derive percolation results in the continuum plane that lead to what appears to be a general tendency of many stochastic network models. Namely, when the selection mechanism according to which nodes are connected to each other, is sufficiently spread out, then a lower density of nodes, or on average fewer connections per node, are sufficient to obtain an unbounded connected component. We look...
متن کاملSpread-out percolation
Fix d ≥ 2, and let X be either Z or the points of a Poisson process in R of intensity 1. Given parameters r and p, join each pair of points of X within distance r independently with probability p. This is the simplest case of a ‘spread-out’ percolation model studied by Penrose [8], who showed that, as r → ∞, the average degree of the corresponding random graph at the percolation threshold tends...
متن کاملSpread-out percolation in R
Fix d ≥ 2, and let X be either Z or the points of a Poisson process in R of intensity 1. Given parameters r and p, join each pair of points of X within distance r independently with probability p. This is the simplest case of a ‘spread-out’ percolation model studied by Penrose [8], who showed that, as r →∞, the average degree of the corresponding random graph at the percolation threshold tends ...
متن کاملBond percolation on multiplex networks
We present an analytical approach for bond percolation on multiplex networks and use it to determine the expected size of the giant connected component and the value of the critical bond occupation probability in these networks. We advocate the relevance of these tools to the modeling of multilayer robustness and contribute to the debate on whether any benefit is to be yielded from studying a f...
متن کاملBond Percolation on Isoradial Graphs
In an investigation of percolation on isoradial graphs, we prove the criticality of canonical bond percolation on isoradial embeddings of planar graphs, thus extending celebrated earlier results for homogeneous and inhomogeneous square, triangular, and other lattices. This is achieved via the star–triangle transformation, by transporting the box-crossing property across the family of isoradial ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Applied Probability
سال: 1993
ISSN: 1050-5164
DOI: 10.1214/aoap/1177005518